Order:
  1.  49
    A reduction theorem for normal algorithms.R. M. Baer - 1969 - Mathematical Logic Quarterly 15 (13-15):219-222.
  2.  42
    Certain Directed Post Systems and Automata.R. M. Baer - 1967 - Mathematical Logic Quarterly 13 (7-12):151-174.
  3.  52
    Definability by turing machines.R. M. Baer - 1969 - Mathematical Logic Quarterly 15 (20-22):325-332.
  4. Schwichtenberg Helmut. Rekursionszahlen und die Grzegorczyk-Hierarchie. Archiv für mathematische Logik und Grundlagenforschung, vol. 12 , pp. 85–97. [REVIEW]R. M. Baer - 1970 - Journal of Symbolic Logic 35 (3):480.
  5.  17
    Axt Paul. Iteration of primitive recursion. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 , pp. 253–255. [REVIEW]R. M. Baer - 1970 - Journal of Symbolic Logic 35 (3):479-479.
  6.  39
    Bečvář Jiří. A universal Turing machine with a programming tape. Colloquium on the Foundations of Mathematics, Mathematical Machines and Their Applications, Tihany, 11–15 September 1962, edited by Kalmár László, Akadémiai Kiadó, Budapest 1965, pp. 11–20. [REVIEW]R. M. Baer - 1971 - Journal of Symbolic Logic 36 (3):535-535.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark